#include<iostream>
#include<queue>
using namespace std;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    priority_queue<int> que;
    deque<int> sec;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        que.push(x);
    }
    while(!que.empty())
    {
        if(que.top()<sec.front())sec.pop_front();
        sec.push_back(que.top());
        que.pop();
    }
    cout<<sec.size();
    return 0;
}